Many-to-Many Data Trading Algorithm Based on Double Auction Theory

Many-to-Many Disjoint Path Covers in Double Loop Networks

A theory of stability in many-to-many matching markets

Wedevelop a theory of stability inmany-to-manymatchingmarkets. We give conditions under which the setwise-stable set, a core-like concept, is nonempty and can be approached through an algorithm. The usual core may be empty. The setwise-stable set coincides with the pairwise-stable set and with the predictions of a non-cooperative bargainingmodel. The setwise-stable set possesses the conflict/co...

Many-Events Theory for Many-Worlds Interpretation

The probabilistic prediction of quantum theory is mystery. In this paper I solved the mystery by Many-Events Theory. In this theory an absolute value of a wave function is a radius of a new space. This suggests the unification between quantum theory and the theory of relativity.

Augmented CycleGAN: Learning Many-to-Many Mappings from Unpaired Data

Learning inter-domain mappings from unpaired data can improve performance in structured prediction tasks, such as image segmentation, by reducing the need for paired data. CycleGAN was recently proposed for this problem, but critically assumes the underlying inter-domain mapping is approximately deterministic and one-to-one. This assumption renders the model ineffective for tasks requiring flex...

On Core Selection Algorithm for Reducing Delay Variation of Many-to-Many Multicasts with Delay-Bounds

With the proliferation of multimedia group applications, the construction of multicast trees satisfying the quality of service (QoS) requirements is becoming a problem of the prime importance. In this paper, we study the core selection problem that should produce the improved delay-bounded multicast tree in terms of the delay variation that is known to be NP-complete [8]. A solution to this pro...